Randomized and Parameterized Algorithms for the Closest String Problem
نویسندگان
چکیده
منابع مشابه
Kernel Lower Bounds on String Problems
In Closest String problem we are given a set of strings S = {s1, s2, . . . , sk} over an alphabet Σ such that |si| = n and an integer d. The objective is to check whether there exists a string s over Σ such that dH(s, si) ≤ d, i ∈ {1, . . . , k}, where dH(x, y) denotes the number of places strings x and y differ at. Closest String is a prototype string problem. This problem together with severa...
متن کاملLower Bounds for Approximation Schemes for Closest String
In the Closest String problem one is given a family S of equal-length strings over some fixed alphabet, and the task is to find a string y that minimizes the maximum Hamming distance between y and a string from S. While polynomial-time approximation schemes (PTASes) for this problem are known for a long time [Li et al.; J. ACM’02], no efficient polynomial-time approximation scheme (EPTAS) has b...
متن کاملMore Efficient Algorithms for Closest String and Substring Problems
The closest string and substring problems find applications in PCR primer design, genetic probe design, motif finding, and antisense drug design. For their importance, the two problems have been extensively studied recently in computational biology. Unfortunately both problems are NP-complete. Researchers have developed both fixed-parameter algorithms and approximation algorithms for the two pr...
متن کاملElectromagnetism-like Algorithms for The Fuzzy Fixed Charge Transportation Problem
In this paper, we consider the fuzzy fixed-charge transportation problem (FFCTP). Both of fixed and transportation cost are fuzzy numbers. Contrary to previous works, Electromagnetism-like Algorithms (EM) is firstly proposed in this research area to solve the problem. Three types of EM; original EM, revised EM, and hybrid EM are firstly employed for the given problem. The latter is being firstl...
متن کاملCombinatorial and Probabilistic Approaches to Motif Recognition
Short substrings of genomic data that are responsible for biological processes, such as gene expression, are referred to as motifs. Motifs with the same function may not entirely match, due to mutation events at a few of the motif positions. Allowing for non-exact occurrences significantly complicates their discovery. Given a number of DNA strings, the motif recognition problem is the task of d...
متن کامل